Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs
نویسندگان
چکیده
منابع مشابه
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs
We determine the minimum size of n-factor-critical graphs and that of k-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of k-extendable non-bipartite graphs for k = 1, 2, and pose a related conjecture for general k.
متن کاملCharacterizing 2k-critical graphs and n-extendable graphs
Let G be a graph with even order. Let M be a matching in G and x1, x2, . . . , x2r , be the M-unsaturated vertices in G. Then G has a perfect matching if and only if there are r independentM-augmenting paths joining the 2r vertices in pairs. LetG be a graph with a perfect matchingM . It is proved that G is 2k-critical if and only if for any 2k vertices u1, u2, . . . , u2k in G, there are k inde...
متن کاملOn critically k-extendable graphs
Let G be a simple connected graph on 2n vertices with a perfect matching. G is k-extendable if for any set M of k independent edges, there exists a perfect matching in G containing all the edges of M. G is critically k-extendable if G is k-extendable but G + uv is not k-extendable for any non-adjacent pair of vertices u and v of G. The problem that arises is that of characterizing k-extendable ...
متن کاملMinimum Degree of Graphs and (g, f, n)-Critical Graphs
Let G be a graph of order p, and let a and b and n be nonnegative integers with 1 ≤ a ≤ b, and let g and f be two integer-valued functions defined on V (G) such that a ≤ g(x) ≤ f(x) ≤ b for all x ∈ V (G). A (g, f)-factor of graph G is defined as a spanning subgraph F of G such that g(x) ≤ dF (x) ≤ f(x) for each x ∈ V (G). Then a graph G is called a (g, f, n)-critical graph if after deleting any...
متن کاملOn (n, k)-extendable graphs and induced subgraphs
Let G be a graph with vertex set V (G). Let n and k be non-negative integers such that n + 2k ≤ |V (G)| − 2 and |V (G)| − n is even. If when deleting any n vertices of G the remaining subgraph contains a matching of k edges and every k-matching can be extended to a 1-factor, then G is called an (n, k)−extendable graph. In this paper we present several results about (n, k)-extendable graphs and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2011
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-011-1045-y